Rational Graphs Trace Context-Sensitive Languages
نویسندگان
چکیده
This paper shows that the traces of rational graphs coincide with the context-sensitive languages.
منابع مشابه
The synchronized graphs trace the context-sensitive languages
Morvan and Stirling have proved that the context-sensitive languages are exactly the traces of graphs defined by transducers with labelled final states. We prove that this result is still true if we restrict to the traces of graphs defined by synchronized transducers with labelled final states. From their construction, we deduce that the context-sensitive languages are the languages of path lab...
متن کاملContextual Graph Grammars Characterising Rational Graphs
Deterministic graph grammars generate a family of infinite graphs which characterise contextfree (word) languages. The present paper introduces a context-sensitive extension of these grammars. We prove that this extension characterises rational graphs (whose traces are contextsensitive languages). We illustrate that this extension is not straightforward: the most obvious context-sensitive graph...
متن کاملTraces of Term-Automatic Graphs
In formal language theory, many families of languages are defined using either grammars or finite acceptors. For instance, context-sensitive languages are the languages generated by growing grammars, or equivalently those accepted by Turing machines whose work tape’s size is proportional to that of their input. A few years ago, a new characterisation of context-sensitive languages as the sets o...
متن کاملIntroduction to rational graphs
Using rationality, like in language theory, we define a family of infinite graphs. This family is a strict extension of the context-free graphs of Muller and Schupp, the equational graphs of Courcelle and the prefix recognizable graphs of Caucal. We give basic properties, as well as an internal and an external characterization of these graphs. We also show that their traces form an AFL of recur...
متن کاملOn Rational Graphs
Using rationality, like in language theory, we de ne a family of in nite graphs. This family is a strict extension of the context-free graphs of Muller and Schupp, the equational graphs of Courcelle and the pre x recognizable graphs of Caucal. We give basic properties, as well as an internal and an external characterization of these graphs. We also show that their traces form an AFL of recursiv...
متن کامل